System Description: SystemOn TPTP
نویسنده
چکیده
SystemOnTPTP is a WWW interface that allows an ATP problem to be easily and quickly submitted in various ways to a range of ATP systems. The interface uses a suite of currently available ATP systems, which are maintained in a database structure. The interface is generated directly from the database, and thus is as current as the database. The interface is a single WWW page, in three parts: the problem specification part, the mode specification part, and the system selection part. A user specifies the problem first, optionally selects systems for use, and then specifies the mode of use.
منابع مشابه
The TPTP Problem
This report provides a detailed description of the TPTP Problem Library for automated theorem proving systems. This library is available via Internet, and is intended to form a common basis for the development of and experimentation with automated theorem provers. To support this goal, this report provides the motivations for building the library; a discussion of troublesome issues, and how the...
متن کاملSMTtoTPTP - A Converter for Theorem Proving Formats
SMTtoTPTP is a converter from proof problems written in the SMT-LIB format into the TPTP TFF format. The SMT-LIB format supports polymorphic sorts and frequently used theories like those of uninterpreted function symbols, arrays, and certain forms of arithmetics. The TPTP TFF format is an extension of the TPTP format widely used by automated theorem provers, adding a sort system and arithmetic ...
متن کاملNitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod (System Description)∗
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based firstorder relational model finder. Nitpick supports unbounded quantification, (co)inductive predicates and datatypes, and (co)recursive functions. Fundamentally a finite model finder, it approximates infinite types by finite subsets. Our experimental results on Isabelle theories and the TPTP library indic...
متن کاملRepresenting Logics of Theorem Provers TLTP: Tens of Logics for Theorem Provers
The TPTP language has been very successful as an interchange format for theorem proving problems in first-order logic. Recently, several efforts have been made to extend it to other logics. But these extensions raise two principal concerns. Firstly, they require a substantially more complex type system than first-order logic. Secondly, it becomes necessary to specify the relations between the v...
متن کاملProgress in the Development of Automated Theorem Proving for Higher-Order Logic
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-order Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higher-order logic, with corresponding infrastructure and resources. This paper describes the practical progress ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000